package com.cong.sort.recursion;

/**
 * @author cong
 * <p>
 * created on 2021/3/19 下午2:06
 */
public class RecursionFibonacci {

    public static void main(String[] args) {
        System.out.println(fibo(10));
    }

    static long fibo(int n) {
        if (n < 1) return -1;
        if (n == 1) return 1;
        return n + fibo(n - 1);
    }
}
